#include <bits/stdc++.h>
using namespace std;

struct node{
		int m;
		int id;
		bool operator < (const node &n)const{
			if(m != n.m) return m < n.m;
			if(id != n.id) return id > n.id;
			return 0;
		}
};

int t;
node a[100005];
int ans = 0;

int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin >> t;
	ans = t;
	for(int i = 0;i < t;i ++){
		cin >> a[i].m;
		a[i].id = 1;
	}
	sort(a,a + t);
	for(int i = 1;i < t;i++){
		if(a[i].m > a[i - 1].m && a[i - 1].m != 0 && a[i].id == 1) {
			a[i - 1].m = 0;
			ans --;
			a[i].id = 0;
			sort(a,a + t);
			i --;
			
		}
		
	}
	cout << ans;
			return 0;
}

